Fast Discrete Multi-Dimensional Scaling
نویسنده
چکیده
Multi-dimensional scaling (MDS) is the process of transforming a set of vectors in a high dimensional space to a lower dimensional one while preserving the similarity structure of the vectors. While effective methods have been found for solving this problem in the general case, they depend on the vectors in the lower dimensional space having real-valued components. However, for some applications, the training of neural networks in particular, it is preferable to have vectors in a discrete, binary space. Unfortunately, performing optimized MDS into a low-dimensional discrete space appears to be much harder than into a continuous space. This paper presents a relatively fast and effective method for performing approximately optimized, discrete MDS.
منابع مشابه
THE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL
The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...
متن کاملTexture Mapping via Texture-Adaptive Spherical Multi-Dimensional Scaling
We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi-dimensional scaling (MDS). MDS is a family of methods that map a set of points into a nite dimensional domain by minimizing the difference in distances between every pair of points in the original and the new embedding domain...
متن کاملTexture Mapping via Spherical Multi-dimensional Scaling
We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi-dimensional scaling (MDS). MDS is a family of methods that map a set of points into a nite dimensional domain by minimizing the difference in distances between every pair of points in the original and the new embedding domain...
متن کاملAn Energy-Preserving Wavelet Collocation Method for General Multi-Symplectic Formulations of Hamiltonian PDEs
In this paper, we develop a novel energy-preserving wavelet collocation method for solving general multi-symplectic formulations of Hamiltonian PDEs. Based on the autocorrelation functions of Daubechies compactly supported scaling functions, the wavelet collocation method is conducted for spatial discretization. The obtained semi-discrete system is shown to be a finite-dimensional Hamiltonian s...
متن کاملA new conforming mesh generator for three-dimensional discrete fracture networks
Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000